Semantically Guided Theorem Proving for Diagnosis Applications
نویسندگان
چکیده
In this paper we demonstrate how general purpose automated theorem proving techniques can be used to solve realistic model-based diagnosis problems. For this we modify a model generating tableau calculus such that a model of a correctly behaving device can be used to guide the search for minimal diagnoses. Our experiments show that our general approach is competitive with specialized diagnosis systems.
منابع مشابه
Semantically Guided Theorem Proving for Diagnosis Applications
In this paper we demonstrate how general purpose automated theorem proving techniques can be used to solve realistic model-based diagnosis problems. For this we modify a model generating tableau calculus such that a model of a correctly behaving device can be used to guide the search for minimal n-fault diagnoses. Our experiments show that our general approach is competitive with specialized di...
متن کاملDesigning Examples for Semantically Guided Hierarchical Deduction
Semantically guided hierarchical deduction prover is a resolution-based theorem-proving procedure which is capable of using the domain dependent knowledge presented in well designed examples. This paper gives an overview of the basic deduction components of the prover, investigates some rules for human design of examples, and demonstrates their usage in proving several non-trivial theorems.
متن کاملSemantically-guided goal-sensitive theorem proving
We present a new inference system for first-order logic, named SGGS, which stands for semantically-guided goal-sensitive theorem proving. SGGS generalizes the model-based reasoning of the Davis-Putnam-Logemann-Loveland (DPLL) procedure. Starting from an initial interpretation, which makes it semantically guided, SGGS uses a sequence of constrained clauses to represent a current model, instance ...
متن کاملSGGS Theorem Proving: an Exposition
We present in expository style the main ideas in SGGS, which stands for Semantically-Guided GoalSensitive theorem proving. SGGS uses sequences of constrained clauses to represent models, instance generation to go from a candidate model to the next, and resolution as well as other inferences to repair the model. SGGS is refutationally complete for first-order logic, DPLL-style model based, seman...
متن کاملSemantically Constrained Condensed Detachment Is Incomplete Semantically Constrained Condensed Detachment Is Incomplete
In reporting on the theorem prover SCOTT (Slaney, SCOTT: A Semantically Guided Theorem Prover, Proc. IJCAI, 1993) we suggested semantic constraint as as an appropriate mechanism for guiding proof searches in propositional systems where the rule of inference is condensed detachment|a generalisation of Modus Ponens. Such constrained condensed detachment is closely analogous to semantic resolution...
متن کامل